Logical and algebraic properties of generalized orthomodular posets
نویسندگان
چکیده
Abstract Generalized orthomodular posets were introduced recently by D. Fazio, A. Ledda and the first author of present paper in order to establish a useful tool for studying logic quantum mechanics. They investigated structural properties these posets. In paper, we study logical algebraic particular, investigate conditions under which they can be converted into operator residuated structures. Further, their representation means algebras (directoids) with everywhere defined operations. We prove congruence class assigned generalized and, subvariety this determined simple identity. Finally, contrast fact that Dedekind-MacNeille completion an poset need not lattice, show stronger version is nearly lattice.
منابع مشابه
Orthomodular algebraic lattices related to combinatorial posets
We extend some theoretical results in the frame of concurrency theory, which were presented in [1]. In particular, we focus on partially ordered sets (posets) as models of nonsequential processes [2] and we apply the same construction as in [1] of a lattice of subsets of points of the poset via a closure operator defined on the basis of the concurrency relation, viewed as lack of causal depende...
متن کاملAlgebraic properties and dismantlability of finite posets
We show that every finite connected poser which admits certain operations such as Gumm or J6nsson operations, or a near unanimity function is dismantlable. This result is used to prove that a finite poset admits Gumm operations if and only if it admits a near unanimity function. Finite connected posets satisfying these equivalent conditions are characterized by the property that their idempoten...
متن کاملOn Stability of Regional Orthomodular Posets
The set of regions of a transition system, ordered by set inclusion, is an orthomodular poset, often referred to as quantum logic, here called regional logic. Regional logics, which result to be also regular and rich, are the main subject of investigation in this work. Given a regular, rich logic L, one can build a condition/event transition system A, such that L embeds into the regional logic ...
متن کاملAlgebraic and logical descriptions of generalized trees
Quasi-trees generalize trees in that the unique “path” between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound of the rank-widths of its finite induced subgraphs. Join-trees are the corresponding directed trees. They are useful to define the modular decomposition of a...
متن کاملStates on Orthomodular Posets of Decompositions
In Harding (1996; see also Harding, 1998, 1999), a method was given to construct an orthomodular poset Fact X from the direct product decompositions of a set. As this forms the basis of our study we briefly review the pertinent facts. For a set X let Eq X denote the set of equivalence relations on X, use ◦ for relational product, 1 for the least equivalence relation on X, and ∇ for the largest....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Slovaca
سال: 2022
ISSN: ['0139-9918', '1337-2211']
DOI: https://doi.org/10.1515/ms-2022-0018